De Finetti Lattices and Magog Triangles

نویسندگان

چکیده

The order ideal $B_{n,2}$ of the Boolean lattice $B_n$ consists all subsets size at most $2$. Let $F_{n,2}$ denote poset refinement induced by rules: $i < j$ implies $\{i \} \prec \{ j \}$ and $\{i,k \{j,k\}$. We give an elementary bijection from set $\mathcal{F}_{n,2}$ linear extensions to shifted standard Young tableau shape $(n, n-1, \ldots, 1)$, which are counted strict-sense ballot numbers. find a more surprising result when considering $\mathcal{F}_{n,2}^{1}$ minimal refinements in each singleton is comparable with doubletons. show that magog triangles, therefore equinumerous alternating sign matrices. adopt our proof techniques row reversal matrix corresponds natural involution on gog triangles.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computable de Finetti measures

We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes in probabilistic functional programming languages can be automatically rewritten as procedures that do not modify non-local state. Along the way, we prove that a distribution on the unit interval is computable if and only if its ...

متن کامل

De Finetti Meets Ellsberg

The paper outlines an exchangeable non-Bayesian model of preference generalizing the Savage/de Finetti classic model of subjective expected utility preference with an exchangeable prior. The treatment is informal, and the emphasis is on motivation and potential applications rather than on axiomatic foundations and technical details. The objective is to provide a widely accessible introduction t...

متن کامل

De Finetti Coherence and Beyond

The aim of the tutorial is to present the concept of coherence, which dates back to de Finetti, showing its role in managing incomplete (or missing) information. We will start recalling the notion of coherence for (unconditional) probabilities and the related fundamental theorem. Then, in order to generalize this notion to assessments on a set of conditional events, the axiomatic definition of ...

متن کامل

Bruno de Finetti and Imprecision

We review several of de Finetti’s fundamental contributions where these have played and continue to play an important role in the development of imprecise probability research. Also, we discuss de Finetti’s few, but mostly critical remarks about the prospects for a theory of imprecise probabilities, given the limited development of imprecise probability theory as that was known to him.

متن کامل

Probabilistic programs, computability, and de Finetti measures

The complexity of probabilistic models, especially those involving recursion, has far exceeded the representational capacity of graphical models. Functional programming languages with probabilistic choice operators have recently been proposed as universal representations for statistical modeling (e.g., IBAL [Pfe01], λ◦ [PPT08], Church [GMR08]). The conditional independence structure of a probab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Combinatorics

سال: 2021

ISSN: ['1077-8926', '1097-1440']

DOI: https://doi.org/10.37236/9246